The Lanczos Method with Semi-inner Product
نویسنده
چکیده
The spectral transformation Lanczos method is very popular for solving large scale Her-mitian generalized eigenvalue problems. The method uses a special inner product so that the symmetric Lanczos method can be used. Sometimes, a semi-inner product must be used. This may lead to instabilities and breakdown. In this paper, we suggest a cure for breakdown by use of an implicit restart in the Lanczos method.
منابع مشابه
A Theoretical Comparison between Inner Products in the Shift-invert Arnoldi Method and the Spectral Transformation Lanczos Method
The spectral transformation Lanczos method and the shift-invert Arnoldi method are probably the most popular methods for the solution of linear generalized eigenvalue problems originating from engineering applications, including structural and acoustic analyses and fluid dynamics. The orthogonalization of the Krylov vectors requires inner products. Often, one employs the standard inner product,...
متن کامل$C^{*}$-semi-inner product spaces
In this paper, we introduce a generalization of Hilbert $C^*$-modules which are pre-Finsler modules, namely, $C^{*}$-semi-inner product spaces. Some properties and results of such spaces are investigated, specially the orthogonality in these spaces will be considered. We then study bounded linear operators on $C^{*}$-semi-inner product spaces.
متن کاملEfficient Algorithms for Estimating the Absorption Spectrum within Linear Response TDDFT.
We present a special symmetric Lanczos algorithm and a kernel polynomial method (KPM) for approximating the absorption spectrum of molecules within the linear response time-dependent density functional theory (TDDFT) framework in the product form. In contrast to existing algorithms, the new algorithms are based on reformulating the original non-Hermitian eigenvalue problem as a product eigenval...
متن کاملThe Lanczos Algorithm and Hankel Matrix Factorization
In 1950 Lanczos [22] proposed a method for computing the eigenvalues of symmetric and nonsymmetric matrices. The idea was to reduce the given matrix to a tridiagonal form, from which the eigenvalues could be determined. A characterization of the breakdowns in the Lanczos algorithm in terms of algebraic conditions of controllability and observability was addressed in [6] and [26]. Hankel matrice...
متن کاملLAPACK working note 51 Qualitative Properties of the Conjugate Gradient and Lanczos Methods in a Matrix Framework
This paper presents the conjugate gradient and Lanczos methods in a matrix framework, focusing mostly on orthogonality properties of the various vector sequences generated. Various aspects of the methods, such as choice of inner product, preconditioning, and relations to other iterative methods will be considered. Minimization properties of the methods and the fact that they can compute success...
متن کامل